Synthesis of quasi-optimal fast filters by the least square criterion
نویسندگان
چکیده
The subject of the article research is special signal processing methods based on optimal discrete filtering theory. goal to increase efficiency model-based for information signals by reducing computational costs and increasing speed algorithms. Applied methods: description dynamic processes in terms state space using elements vector-matrix algebra, weighted least squares method, Kalman's theory filtering, basic concepts O'Reilly–Luenberger functional observers, probability theory, statistical modeling Monte Carlo method. Results: a new method proposed, which uses approximation Kalman filter transfer matrix time dependence given piecewise linear functions according criterion. effectiveness was evaluated example second-order dynamical system. On basis comparative analysis, several acceptable variants considered are proposed. practical significance work lies further development synthesis quasi-optimal high-speed filters. operability proposed modifications confirmed algorithms criterion "accuracy-computational costs". It shown that total savings number multiplication addition operations can reach tens times due insignificant losses accuracy process.
منابع مشابه
Fast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملVLSI high level synthesis of fast exact least mean square algorithms based on fast FIR filters
This paper relates experiences of algorithmic transformations in High Level Synthesis, in the area of acoustic echo cancellation. The processing and memory units are automatically designed for various equivalent LMS algorithms, in the FIR case, with important computational load. The results obtained with di erent lter lengths, give an accurate prototyping of new fast versions of the LMS algorit...
متن کاملVideo enhancement using content-adaptive least mean square filters
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملRecurrent least square learning for quasi-parallel principal component analysis
The recurrent least squares (RLS) learning approach is proposed for controlling the learning rate in parallel principal subspace analysis (PSA) and in a wide class of principal component analysis (PCA) associated algorithms with a quasi{parallel extraction ability. The purpose is to provide a useful tool for applications where the learning process has to be repeated in an on{line self{adaptive ...
متن کاملSeepage with Nonlinear Permeability by Least Square FEM
In seepage problems, the coefficients of permeability in Laplace equation are usually assumed to be constant vs. both space and time; but in reality these coefficients are variable. In this study, the effect of material deformation due to external loads (consolidation) and variation of head in the consolidation process are considered. For the first case, formulation of kx and ky can be defined ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Su?asnì ìnformacìjnì sistemi
سال: 2023
ISSN: ['2522-9052']
DOI: https://doi.org/10.20998/2522-9052.2023.2.04